منابع مشابه
Lattice Spanners of Low Degree
Let δ0(P, k) denote the degree k dilation of a point set P in the domain of plane geometric spanners. If Λ is the infinite square lattice, it is shown that 1+ √ 2 ≤ δ0(Λ, 3) ≤ (3+2 √ 2) 5−1/2 = 2.6065 . . . and δ0(Λ, 4) = √ 2. If Λ is the infinite hexagonal lattice, it is shown that δ0(Λ, 3) = 1 + √ 3 and δ0(Λ, 4) = 2. All our constructions are planar lattice tilings constrained to degree 3 or 4.
متن کاملSpanners, Weak Spanners, and Power Spanners for Wireless Networks
For , a -spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most times their geometric distance. Based on this property to approximate a complete weighted graph, sparse spanners have found many applications, e.g., in FPTAS, geometric searching, and radio networks. In a weak -spanner, this path may be arbitrary l...
متن کاملLow-distortion low-voltage operational transconductance amplifier
Introduction: Recent research shows a high demand for highly linear operational transconductance amplifiers (OTAs) with an aim to reduce total harmonic distortion (THD) [1–4]. However, most of these linearisation techniques may present important drawbacks such as reduced effective transconductance and significant power consumption. On the other hand, low power supply and power consumption solut...
متن کاملLow-Distortion Embeddings of Trees
We prove that every tree T = (V,E) on n vertices with edges of unit length can be embedded in the plane with distortion O( √ n); that is, we construct a mapping f :V → R such that ρ(u, v) ≤ ‖f(u) − f(v)‖ ≤ O( √ n) · ρ(u, v) for every u, v ∈ V , where ρ(u, v) denotes the length of the path from u to v in T . The embedding is described by a simple and easily computable formula. This is asymptotic...
متن کاملLow-Light Trees, and Tight Lower Bounds for Euclidean Spanners
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T ) = O(k · n) · w(MST (M)), and a spanning tree T ′ with weight w(T ′) = O(k) · w(MST (M)) and unweighted diameter O(k · n). These trees also achieve an optimal maximum degree. Furthermore, we demonstrate that these trees can be constructed efficiently...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2009
ISSN: 1549-6325,1549-6333
DOI: 10.1145/1644015.1644022